Formulations and Benders Decomposition based Procedures for the Discrete Cost Multicommodity Network Design Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal solution of the discrete cost multicommodity network design problem

We investigate a multicommodity network design problem where a discrete set of technologies with step-increasing cost and capacity functions should be installed on the edges. This problem is a fundamental network design problem having many important applications in contemporary telecommunication networks. We describe an exact constraint generation approach and we show that the conjunctive use o...

متن کامل

Benders decomposition for the hop-constrainted survivable network design problem

survivable network design problem Quentin Botton Center for Supply Chain Managemqent (CESCM), Louvain School of Management, Université catholique de Louvain, Louvain-la-Neuve, Belgium, and CORE, Université catholique de Louvain, Louvain-la-Neuve, Belgium, [email protected] Bernard Fortz GOM, Department of Computer Science, Faculté des Sciences, Université Libre de Bruxelles, Brussels,...

متن کامل

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem

Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by Gouveia (1998), we present a formulation for the problem valid for any K, L ! 1. We use a Benders dec...

متن کامل

Benders, metric and cutset inequalities for multicommodity capacitated network design

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme r...

متن کامل

A Hybrid Solution Approach Based on Benders Decomposition and Meta-Heuristics to Solve Supply Chain Network Design Problem

Supply Chain Network Design (SCND) is a strategic supply chain management problem that determines its configuration. This mainly focuses on the facilities location, capacity sizing, technology selection, supplier selection, transportation, allocation of production and distribution facilities to the market, and so on. Although the optimal solution of the SCND problem leads to a significant reduc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computing and Digital Systems

سال: 2019

ISSN: 2210-142X

DOI: 10.12785/ijcds/080613